MAX-2-SAT: How Good Is Tabu Search in the Worst-Case?
نویسندگان
چکیده
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over local search alone has been already shown experimentally several times. A natural question addressed here is to understand if this superiority holds also from the worst-case point of view. Moreover, it is well known that a critical parameter of tabu techniques is the tabu list length. Focussing on MAX-2-SAT problem, the main contribution of this paper is a worst-case analysis of tabu search as a function of the tabu list length. We give the first theoretical evidence of the advantage of a tabu search strategy over the basic local search alone that critically depends on the tabu list length.
منابع مشابه
Maximum satisfiability: How good are tabu search and plateau moves in the worst-case?
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over local search alone has been already shown experimentally several times. A natural question addressed here is to understand if this superiority holds also from the worst-case point of view. Moreover, it is well known that a critic...
متن کاملOn the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the art in performance for universal (i.e. non specialized solvers) seems to be variants of Simulated Annealing (SA) and MaxWalkSat (MWS), stochastic local search methods. Local search methods are conceptually simple, and ...
متن کاملA Scatter Search Variant to Solve max-SAT Problems
In this work, a new scatter search-based approach is studied for the NP-Hard satisfiability problems, in particular for its optimization version namely max-SAT. The paper describes a scatter search algorithm enhanced with a tabu search component combined with a uniform crossover operator. The latter is used to identify promising search regions while tabu search performs an intensified search of...
متن کاملEfficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT
For problems SAT and MAX SAT, local search algorithms are widely acknowledged as one of the most e ective approaches. Most of the local search algorithms are based on the 1ip neighborhood, which is the set of solutions obtainable by ipping the truth assignment of one variable. In this paper, we consider rip neighborhoods for r 2, and propose, for r = 2; 3, new implementations that reduce the nu...
متن کاملEfficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation
For problems SAT and MAX SAT, local search algorithms are widely acknowledged as one of the most eective approaches. Most of the local search algorithms are based on the 1-ip neighborhood, which is the set of solutions obtainable by ipping the truth assignment of one variable. In this paper, we consider r-BLOCKINip neighborhoods for r = 2; 3, and examine their eectiveness by computational exper...
متن کامل